Generalized conditional entropy optimization for qudit-qubit states
نویسندگان
چکیده
منابع مشابه
Generalized Bloch Spheres for m - Qubit States
m-Qubit states are embedded in Cl2m Clifford algebra. Their probability spectrum then depends on O (2m)or O (2m+ 1)-invariants respectively. Parameter domains for O (2m (+1))-vector and -tensor configurations, generalizing the notion of a Bloch sphere, are derived.
متن کاملTsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions
The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...
متن کاملQuantum Error Correction Codes-From Qubit to Qudit
Quantum computation (QC), with inherent parallelism from the superposition principle of quantum mechanics, promises vast performance improvement over classical computing. QC has become the subject of increasing research interests since Shor showed an efficient algorithm for integer factorization in a quantum system providing exponential speed-up compared with any known classical algorithm. As i...
متن کاملA Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملEfficient Generalized Conditional Gradient with Gradient Sliding for Composite Optimization
Generalized conditional gradient method has regained increasing research interest as an alternative to another popular proximal gradient method for sparse optimization problems. For particular tasks, its low computation cost of linear subproblem evaluation on each iteration leads to superior practical performance. However, the inferior iteration complexity incurs excess number of gradient evalu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2014
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.90.042318